Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric

نویسندگان

  • Francisco Perdomo
  • Angel Plaza
چکیده

From an initial triangle, three triangles are obtained joining the two equally spaced points of the longest-edge with the opposite vertex. This construction is the base of the longestedge trisection method. Let D be an arbitrary triangle with minimum angle a. Let D be any triangle generated in the iterated application of the longest-edge trisection. Let a0 be the minimum angle of D. Thus a0 P a=c with c 1⁄4 p=3 arctan ffiffi 3 p =11 ð Þ is proved in this paper. A region of the complex half-plane, endowed with the Poincare hyperbolic metric, is used as the space of triangular shapes. The metric properties of the piecewise-smooth complex dynamic defined by the longest-edge trisection are studied. This allows us to obtain the value c. 2013 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Meir-Keeler Type Contraction Mappings in $c_0$-triangular Fuzzy Metric Spaces

Proving  fixed point theorem in a fuzzy metric space is not possible for  Meir-Keeler contractive mapping. For this, we introduce the notion of $c_0$-triangular fuzzy metric space. This new space allows us to prove some fixed point theorems for  Meir-Keeler contractive mapping. As some pattern we introduce the class of $alphaDelta$-Meir-Keeler contractive and we establish some results of fixed ...

متن کامل

A local refinement algorithm for the longest-edge trisection of triangle meshes

In this paper we present a local refinement algorithm based on the longest-edge trisection of triangles. Local trisection patterns are sed to generate a conforming triangulation, depending on the number of non-conforming nodes per edge presented. We describe he algorithm and provide a study of the efficiency (cost analysis) of the triangulation refinement problem. The algorithm presented, nd it...

متن کامل

A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes

In this note, by using complex variable functions, we present a new simpler proof of the degeneracy property of the longest-edge n-section of triangles for n P 4. This means that the longest-edge n-section of triangles for n P 4 produces a sequence of triangles with minimum interior angle converging to zero. 2012 Elsevier Inc. All rights reserved.

متن کامل

The Principle of Relativity: From Ungar’s Gyrolanguage for Physics to Weaving Computation in Mathematics

‎This paper extends the scope of algebraic computation based on a non standard $times$ to ‎the more basic case of a non standard $+$‎, ‎where standard means associative ‎and commutative‎. ‎Two physically meaningful examples of a non standard $+$ are ‎provided by the observation of motion in Special Relativity‎, ‎from either ‎outside (3D) or inside (2D or more)‎, ‎We revisit the ``gyro''-theory ...

متن کامل

The Wijsman structure of a quantale-valued metric space

We define and study a quantale-valued Wijsman structure on the hyperspace of all non-empty closed sets of a quantale-valued metric space. We show its admissibility and that the metrical coreflection coincides with the quantale-valued Hausdorff metric and that, for a metric space, the topological coreflection coincides with the classical Wijsman topology. We further define an index of compactnes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 221  شماره 

صفحات  -

تاریخ انتشار 2013